Hamilton Operators, Discrete Symmetries, Brute Force and SymbolicC++

نویسندگان

  • Willi-Hans Steeb
  • Yorick Hardy
چکیده

Abstract To find the discrete symmetries of a Hamilton operator Ĥ is of central importance in quantum theory. Here we describe and implement a brute force method to determine the discrete symmetries given by permutation matrices for Hamilton operators acting in a finite-dimensional Hilbert space. Spin and Fermi systems are considered as examples. A computer algebra implementation in SymbolicC++ is provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An extension of the multi-path algorithm for finding hamilton cycles

The multi-path algorithm for finding hamilton cycles in a graph G is described in the book by Christofides. It is an intelligent exhaustive search for a hamilton cycle. In this paper we describe how the algorithm can be improved in two ways: (1) by detecting small separating sets M for which G–M has more than |M| components; and (2) by detecting bipartitions (X,Y), where |X|<|Y|.

متن کامل

Optimised Calculation of Symmetries for State Space Reduction

Since the state space explosion is a common problem when analysing Petri nets several ways to deal with this problem leading to a smaller – reduced – state space have been invented. One of them is finding symmetries, an equivalence relation on places and transitions of a Petri net, and only evaluating one object from each equivalence class. All other objects in the same class are then known to ...

متن کامل

A Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm

For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...

متن کامل

ar X iv : h ep - p h / 07 02 06 3 v 1 6 F eb 2 00 7 UT - 07 - 06 Solutions to large B and L breaking in the Randall - Sundrum model

The stability of proton and neutrino masses are discussed in the Randall-Sundrum model. We show that relevant operators should be suppressed, if the hierarchical Yukawa matrices are explained only by configurations of wavefunctions for fermions and the Higgs field along the extra dimension. We assume a Z N discrete gauge symmetry to suppress those operators. In the Dirac neutrino case, there is...

متن کامل

Generation of macro-operators via investigation of action dependencies in plans

There are many approaches for solving planning problems. Many of these approaches are based on ‘brute force’ search methods and they usually do not care about structures of plans previously computed in particular planning domains. By analyzing these structures, we can obtain useful knowledge that can help us find solutions to more complex planning problems. The method described in this paper is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1208.4721  شماره 

صفحات  -

تاریخ انتشار 2012